The diophantine problem of Frobenius: A close bound

The conductor of n positive integer numbers a l,a2, ... ,an' whose greatest coII1mon divisor is equal'to I, is'defmed as the th.e minimal K, such that for every m ~K , the equation a1x 1+a2X 2+ ... +an Xn=m, h!ls a solution over the nOI}negative integers. In this notewe give a polYIlomial aigorithm computing'a close bound ~ for the conductor K o( n given positive integers, when n is fixed. The bound B satisfies BIn SK SB . T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 48 3 19 87